-
1 algoritmo ?
(n.) = hill-climbing algorithmEx. The direction of this movement is chosen according to a hill-climbing algorithm.* * *(n.) = hill-climbing algorithmEx: The direction of this movement is chosen according to a hill-climbing algorithm.
-
2 algoritmo
m.algorithm (Mat).* * *1 algorithm* * *SM algorithm* * *= algorithm.Nota: Conjunto finito de reglas precisas que permiten resolver un problema en un número finito de pasos.Ex. Also, if a simple algorithm for the generation of index entries can be stated then additional entries and references can be printed by computer, using the primary index string as input data.----* algoritmo ? = hill-climbing algorithm.* algoritmo de clustering = clustering algorithm.* algoritmo de envío = routing algorithm.* algoritmo de ordenación por pertinencia = ranking algorithm.* algoritmo genético = genetic algorithm (GA).* con algoritmos = algorithmically.* * *= algorithm.Nota: Conjunto finito de reglas precisas que permiten resolver un problema en un número finito de pasos.Ex: Also, if a simple algorithm for the generation of index entries can be stated then additional entries and references can be printed by computer, using the primary index string as input data.
* algoritmo ? = hill-climbing algorithm.* algoritmo de clustering = clustering algorithm.* algoritmo de envío = routing algorithm.* algoritmo de ordenación por pertinencia = ranking algorithm.* algoritmo genético = genetic algorithm (GA).* con algoritmos = algorithmically.* * *algorithm* * *algoritmo nmMat algorithm* * *m algorithm* * *algoritmo nm: algorithm
См. также в других словарях:
Hill climbing — In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is relatively simple to implement, making it a popular first choice. Although more advanced algorithms may give better… … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
List of algorithm general topics — This is a list of algorithm general topics, by Wikipedia page. * Analysis of algorithms * Ant colony algorithm * Approximation algorithm * Best and worst cases * Big O notation * Combinatorial search * Competitive analysis * Computability theory… … Wikipedia
Great Deluge algorithm — The Great Deluge algorithm (GD) is a generic algorithm applied to optimization problems. It is similar in many ways to the hill climbing and simulated annealing algorithms.The name comes from the analogy that in a great deluge a person climbing a … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
Prim's algorithm — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Expectation-maximization algorithm — An expectation maximization (EM) algorithm is used in statistics for finding maximum likelihood estimates of parameters in probabilistic models, where the model depends on unobserved latent variables. EM alternates between performing an… … Wikipedia
Levenberg–Marquardt algorithm — In mathematics and computing, the Levenberg–Marquardt algorithm (LMA)[1] provides a numerical solution to the problem of minimizing a function, generally nonlinear, over a space of parameters of the function. These minimization problems arise… … Wikipedia
Gauss–Newton algorithm — The Gauss–Newton algorithm is a method used to solve non linear least squares problems. It can be seen as a modification of Newton s method for finding a minimum of a function. Unlike Newton s method, the Gauss–Newton algorithm can only be used… … Wikipedia
Memetic algorithm — Memetic algorithms (MA) represent one of the recent growing areas of research in evolutionary computation. The term MA is now widely used as a synergy of evolutionary or any population based approach with separate individual learning or local… … Wikipedia
